Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding

We present sparse interpolation algorithms for recovering a polynomial with $\le B$ terms from $N$ evaluations at distinct values the variable when E$ of can be erroneous. Our perform exact arithmetic in field scalars $\mathsf{K}$ and standard powers or Chebyshev polynomials, which case characteristic is $\ne 2$. return list valid interpolants support points run polynomial-time. For power basis our sample $N = \lfloor \frac{4}{3} E + 2 \rfloor points, are fewer than 2(E+1)B - 1$ given by Kaltofen Pernet 2014. \frac{3}{2} also number required algorithm Arnold 2015, has 74 \frac{E}{13} 1 \rfloor$ $B 3$ $E \ge 222$. method shows how to correct $2$ errors block $4B$ $1$ error $3B$ Basis.